Simulation Preorder over Simple Process Algebras
نویسندگان
چکیده
منابع مشابه
Simulation Preorder over Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinitestate processes and finite-state ones. First, we describe a general method how to utilize the decidability of bisimulation problems to solve (certain instances of) the corresponding simulation problems. For certain process classes, the method allows to design effective reductions of simulation problems to their bisimulat...
متن کاملSimulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of infinite-state systems and finite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a finitestate on...
متن کاملTechnische Universit at M U N C H E N Institut F Ur Informatik Simulation Preorder on Simple Process Algebras Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between in nitestate processes and nite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of in nite-state systems and nite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a nite-state one is PSP...
متن کاملTechnische Universit at M U N C H E N Institut F Ur Informatik Simulation Preorder on Simple Process Algebras 1999 Sfb 342 Methoden Und Werkzeuge F Ur Die Nutzung Paralleler Architekturen Simulation Preorder on Simple Process Algebras
We consider the problem of simulation preorder/equivalence between innnite-state processes and nite-state ones. We prove that simulation preorder (in both directions) and simulation equivalence are intractable between all major classes of innnite-state systems and nite-state ones. This result is obtained by showing that the problem whether a BPA (or BPP) process simulates a nite-state one is PS...
متن کاملSemantic reachability for simple process algebras
This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is a state reachable that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Petri nets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3122